Resolution reasoning by RDF Clausal Form Logic
نویسندگان
چکیده
The article presents a simple way how knowledge represented via RDF triples provides an easier method of inference, managing and finding interrelations between knowledge objects than that an approach based on OWL language. The authors of the article come out of the T. Richard’s inference system of the Clausal Form Logic (CFL) based on the formal manipulation with conditional „if – then“ statements, and an idea of RDF extended model (with quantifiers) of knowledge representation to propose an inference mechanism RDF RR working over knowledge bases of RDF triples.
منابع مشابه
Resolution procedures for multiple-valued optimization
Signed clausal forms offer a suitable logical framework for automated reasoning in multiple-valued logics. It turns out that the satisfiability problem of any finitely-valued propositional logic, as well as of certain infinitely-valued logics, can be easily reduced, in polynomial time, to the satisfiability problem of signed clausal forms. On the other hand, signed clausal forms are a powerful ...
متن کاملResolution Strategies for Fuzzy Description Logic
The paper presents experimental comparison of several resolution strategies for reasoning in Fuzzy Description Logic based on Fuzzy Predicate Logic with evaluated syntax. Resolutionbased reasoning is established on previous works concerning non-clausal resolution principle both theoretical and application-oriented (FPLGERDS inference engine).
متن کاملA Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic
The clausal resolution method for propositional linear-time temporal logics is well known and provides the basis for a number of temporal provers. The method is based on an intuitive clausal form, called SNF, comprising three main clause types and a small number of resolution rules. In this paper, we show how the normal form can be radically simplified and, consequently, how a simplified clausa...
متن کاملA Clausal Resolution Method for Extended Computation Tree Logic ECTL
A temporal clausal resolution method was originally developed for linear time temporal logic and further extended to the branching-time framework of Computation Tree Logic (CTL). In this paper, following our general idea to expand the applicability of this efficient method to more expressive formalisms useful in a variety of applications in computer science and AI requiring branching time logic...
متن کاملNon-clausal Resolution Theorem Proving for Description Logic
The article presents refutational resolution theorem proving system for Description Logic (DL) based on general (non-clausal) resolution rule. There is also presented unification algorithm handling existentiality without the need of skolemization in first-order logic. Its idea follows from general resolution with existentiality for first-order logic. When the prover is constructed it provides t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012